Conjunctive Query Answering in Distributed Ontology Systems for Ontologies with Large OWL ABoxes
نویسندگان
چکیده
We present a query processing procedure for conjunctive queries in distributed ontology systems where a large ontology is divided into ontology fragments that are later distributed over a set of autonomous nodes. We focus on ontologies with large ABoxes. The query processing procedure determines and retrieves the facts that are relevant to answering a given query from other nodes, then construct a new fragment that includes the set of relevant facts, the local TBox and RBox. The given query is evaluated against the new fragment and answers are returned to the user. We prove that our technique returns sound answers for queries over OWL ontologies.
منابع مشابه
PAGOdA: Pay-as-you-go ABox Reasoning
Ontologies are increasingly used to provide structure and enhance access to large datasets. In such applications the ontology can be seen as a TBox, and the dataset as an ABox, with the key reasoning problem being conjunctive query (CQ) answering. Unfortunately, for OWL 2 this problem is known to be of high worst case complexity, even when complexity is measured with respect to the size of the ...
متن کاملA Decomposition-Based Approach to Optimizing Conjunctive Query Answering in OWL DL
Scalable query answering over Description Logic (DL) based ontologies plays an important role for the success of the Semantic Web. Towards tackling the scalability problem, we propose a decomposition-based approach to optimizing existing OWL DL reasoners in evaluating conjunctive queries in OWL DL ontologies. The main idea is to decompose a given OWL DL ontology into a set of target ontologies ...
متن کاملScalable highly expressive reasoner (SHER)
In this paper, we describe SHER (Scalable Highly Expressive Reasoner), a breakthrough technology that provides semantic querying of large relational datasets using OWL ontologies. SHER relies on a unique algorithm based on ontology summarization and combines a traditional in-memory description logic reasoner with a database backed RDF Store to scale reasoning to very large Aboxes. In our latest...
متن کاملTowards Temporal Fuzzy Query Answering on Stream-based Data
For reasoning over streams of data ontology-based data access is a common approach. The method for answering conjunctive queries (CQs) over DL-Lite ontologies in this setting is by rewritings of the query and evaluation of the resulting query by a data base engine. For streambased applications the classical expressivity of DL-Lite lacks means to handle fuzzy and temporal information. In this pa...
متن کاملImproving Query Answering over DL-Lite Ontologies
The DL-Lite family of Description Logics has been designed with the specific goal of allowing for answering complex queries (in particular, conjunctive queries) over ontologies with very large instance sets (ABoxes). So far, in DL-Lite systems, this goal has been actually achieved only for relatively simple (short) conjunctive queries. In this paper we present Presto, a new query answering tech...
متن کامل